A Counterexample to Modus Tollens

نویسنده

  • Seth Yalcin
چکیده

This paper defends a counterexample to Modus Tollens, and uses it to draw some conclusions about the logic and semantics of indicative conditionals and probability operators in natural language. Along the way we investigate some of the interactions of these expressions with knows, and we call into question the thesis that all knowledge ascriptions have truthconditions. A probabilistic dynamic semantics for probability operators, conditionals, and acceptance attitudes is developed around the idea of representing the common ground of a conversation as a set of probability spaces.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the joint verification of Modus Ponens and Modus Tollens in fuzzy logic

This paper deals with the joint verification of the inequalities of Modus Ponens and Modus Tollens in Fuzzy Logic. Although the case of Modus Ponens was partially considered before, the case of Modus Tollens and the joint satisfaction of both inequalities are studied by the first time. The cases of R-implications, Simplications, Q-implications and MamdaniLarsen implications are separatedly cons...

متن کامل

On MPT-implication functions for Fuzzy Logic

This paper deals with numerical functions able to functionally express operators defined as , and verifying either Modus Ponens or Modus Tollens, or both. The concrete goal of the paper is to search for continuous t-norms and strong-negation functions for which it is either (Modus Ponens), or (Modus Tollens), or both, for all in and a given . Functions are taken among those in the most usual fa...

متن کامل

Modus Tollens Probabilized

We establish a probabilized version of modus tollens, deriving from p(E jH)1⁄4 a and p( E)1⁄4 b the best possible bounds on p( H). In particular, we show that p( H)! 1 as a, b ! 1, and also as a, b ! 0.

متن کامل

Toward Monotonicity Analysis between Two Vague Concepts Based on Fuzzy Rough Sets

A fuzzy rough set approach has been proposed without using any fuzzy logical connectives. By this approach, gradual decision rules are induced from a given decision table. Fuzzy-rough modus ponens and fuzzy-rough modus tollens have been formulated based on the gradual decision rules. The equivalence condition between fuzzy-rough modus ponens and fuzzy-rough modus tollens is discussed. The condi...

متن کامل

Generalized Modus Tollens with Linguistic Modifiers for Inverse Approximate Reasoning

Based on our previous researchs about generalized modus ponens (GMP) with linguistic modifiers for If ... Then rules, this paper proposes new generalized modus tollens (GMT) inference rules with linguistic modifiers in linguistic many–valued logic framework with using hedge moving rules for inverse approximate reasoning.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Philosophical Logic

دوره 41  شماره 

صفحات  -

تاریخ انتشار 2012